Determining the Minimum Cost Steiner Tree for Delay Constrained Problems

We address a variant of the Steiner tree problem for delay constrained problems. The addressed consists in determining minimum cost tree, while guaranteeing that between any two terminal nodes does not exceed given maximum value. This is known as bounded diameter problem. propose compact formulation based on integer linear programming (ILP) to obtain optimal solutions, which was efficiently solved telecommunication core networks up 75 nodes. However, traditional graphs ILP proved be inefficient, we heuristic method and compare it with formulation. show provides except cases our experiments where provided near-optimal always reasonable runtimes. Additionally, reduce complexity problem, some novel modified graph reductions specific